N-gram Graphs: Representing Documents and Document Sets in Summary System Evaluation
نویسندگان
چکیده
Within this article, we present the application of the AutoSummENG method within the TAC 2009 AESOP challenge. We further offer an alternative to the original AutoSummENG method, which uses an additional operator of the n-gram graph framework to represent a set of documents with a single, merged graph. Both alternatives offer very good results in different aspects of the AESOP results evaluation. The original AutoSummENG method appears a very good linear estimator of Pyramid score and responsiveness, while the new Merged Model variation offers very good (non-linear) rank estimation performance when correlated to the responsiveness measure.
منابع مشابه
A survey on Automatic Text Summarization
Text summarization endeavors to produce a summary version of a text, while maintaining the original ideas. The textual content on the web, in particular, is growing at an exponential rate. The ability to decipher through such massive amount of data, in order to extract the useful information, is a major undertaking and requires an automatic mechanism to aid with the extant repository of informa...
متن کاملAutomatic Summarization from Multiple Documents
This work reports on research conducted on the domain of multi-document summarization using background knowledge. The research focuses on summary evaluation and the implementation of a set of generic use tools for NLP tasks and especially for automatic summarization. Within this work we formalize the n-gram graph representation and its use in NLP tasks. We present the use of n-gram graphs for t...
متن کاملRRLUFF: Ranking function based on Reinforcement Learning using User Feedback and Web Document Features
Principal aim of a search engine is to provide the sorted results according to user’s requirements. To achieve this aim, it employs ranking methods to rank the web documents based on their significance and relevance to user query. The novelty of this paper is to provide user feedback-based ranking algorithm using reinforcement learning. The proposed algorithm is called RRLUFF, in which the rank...
متن کاملA New Domain Independent Keyphrase Extraction System
In this paper we present a keyphrase extraction system that can extract potential phrases from a single document in an unsupervised, domain-independent way. We extract word n-grams from input document. We incorporate linguistic knowledge (i.e., part-of-speech tags), and statistical information (i.e., frequency, position, lifespan) of each n-gram in defining candidate phrases and their respectiv...
متن کاملSummarization System Evaluation Variations Based on N-Gram Graphs
Within this article, we present the application of the AutoSummENG method within the TAC 2010 AESOP challenge. We further present two novel evaluation methods based on n-gram graphs. The first method is called Merged Model Graph (MeMoG) and it uses the ngram graph framework to represent a set of documents with a single, “centroid” graph, offering state-of-the-art performance. The second method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009